Simplified High-Performance Cost Aggregation for Stereo Matching

نویسندگان

چکیده

Applying edge preservation filters for cost aggregation has been a leading technique in generating dense disparity maps. However, traditional approaches usually require intensive calculations, and their design parameters must be tuned different scenarios to obtain the best performance. This paper shows that simple texture-independent approach can achieve similar high The proposed algorithm is equivalent sequence of matrix multiplications involving two weighting matrices primary matching cost. Notably, are constant image pairs with same resolution. For higher accuracy, we integrate multi-scale scheme fully exploit spatial distribution textures pairs. resultant hybrid efficient accurate enough surpass most existing stereo matching. performance verified by extensive simulation results using Middlebury (3rd Edition) benchmark database.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Stereo Matching with Explicit Cost Aggregation Sub-Architecture

Deep neural networks have shown excellent performance for stereo matching. Many efforts focus on the feature extraction and similarity measurement of the matching cost computation step while less attention is paid on cost aggregation which is crucial for stereo matching. In this paper, we present a learning-based cost aggregation method for stereo matching by a novel sub-architecture in the end...

متن کامل

Robust segment-based Stereo using Cost Aggregation

Introduction Most segment based stereo methods estimate disparity by modeling color segments as 3-D planes [2]. Inherently, such methods are sensitive to segmentation parameters and intolerant to segmentation errors. Two main dependencies of these methods on the underlying segmentation algorithm are: size of segments used for estimating planes, and assignment of a single plane to the whole segm...

متن کامل

Fast Edge-Aware Cost Aggregation for Stereo Correspondence

Stereo correspondence computes disparity map needed by many high-level computer vision tasks. Recently local stereo approaches show their ability matching global while keeping efficiency. But it still deserves further research for higher performance. In this paper, we propose a fast edge-aware cost aggregation strategy. It constructs 1D support window based on spatial and gradient information o...

متن کامل

The Naked Truth about Cost Functions for Stereo Matching

This paper reports about the performance of various cost functions as common or possible for stereo matching, within a ‘purist’s matching strategy’, which does not integrate any further optimization approach such as a continuity term, coarse-to-fine, left/right consistency checks, or others. The performed experiments support a few general conclusions, such as about the relation between 1Dor 2D-...

متن کامل

Aggregation functions to combine RGB color channels in stereo matching.

In this paper we present a comparison study between different aggregation functions for the combination of RGB color channels in stereo matching problem. We introduce color information from images to the stereo matching algorithm by aggregating the similarities of the RGB channels which are calculated independently. We compare the accuracy of different stereo matching algorithms and aggregation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13031791